Tight results for Next Fit and Worst Fit with resource augmentation
نویسندگان
چکیده
منابع مشابه
Tight results for Next Fit and Worst Fit with resource augmentation
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable algorithm, since it never opens a new bin if an existing bin can still be used. Using resource augmented analysis, where the output of an approximation algorithm, which can use bins of size b > 1, is compared to an optima...
متن کاملTight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
Abstract. The bin packing problem is to pack a list of reals in (0, 1] into unit-capacity bins using the minimum number of bins. Let R[A] be the limiting worst value for the ratio A(L)/L* as L* goes to x, where A(L) denotes the number ofbins used in the approximation algorithm A, and L* denotes the minimum number ofbins needed to pack L. Obviously, R[A] reflects the worst-case behavior of A. Fo...
متن کاملComparing First-Fit and Next-Fit for Online Edge Coloring
We study the performance of the algorithms First-Fit and Next-Fit for two online edge coloring problems. In the min-coloring problem, all edges must be colored using as few colors as possible. In the max-coloring problem, a fixed number of colors is given, and as many edges as possible should be colored. Previous analysis using the competitive ratio has not separated the performance of First-Fi...
متن کاملJava Memory Allocation with Lazy Worst Fit for Small Objects
Memory allocation is an important part of modern programming languages, including garbagecollected languages such as Java. We propose a fast memory allocation scheme for Java using lazy worst fit (LWF), where pointer increment is used as the primary allocation method and worst fit is used as a backup. We evaluated LWF on a working Java virtual machine with non-moving garbage collection, and the...
متن کاملIntersection types fit well with resource control
The notion of resource awareness and control has gained an important role both in theoretical and practical domains: in logic and lambda calculus as well as in programming languages and compiler design. The idea to control the use of formulae is present in Gentzen’s sequent calculus’ structural rules ([6]), whereas the idea to control the use of variables can be traced back to Church’s λI-calcu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.03.019